The limit shape of convex hull peeling
نویسندگان
چکیده
منابع مشابه
Non-convex onion-peeling using a shape hull algorithm
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملConvex Hull Asymptotic Shape Evolution
The asymptotic properties of Rapidly exploring Random Tree (RRT) growth in large spaces is studied both in simulation and analysis. The main phenomenon is that the convex hull of the RRT reliably evolves into an equilateral triangle when grown in a symmetric planar region (a disk). To characterize this and related phenomena from flocking and swarming, a family of dynamical systems based on incr...
متن کاملPartial shape matching using convex hull and Fourier descriptors
An application of Fourier descriptors and convex hull for shape analysis is presented. Convex hull is used for dividing a shape into small parts. Amplitude spectrum which is invariant to scaling, translation and choosing a starting point is obtained from the Fourier descriptors (see e.g [1-3]) and used for comparison. All calculations are performed with the author's software and some algorithms...
متن کاملComputing minimum-area rectilinear convex hull and L-shape
Article history: Received 21 February 2008 Accepted 24 February 2009 Available online 24 March 2009 Communicated by T. Asano
متن کاملDynamic Ham-Sandwich Cuts for Two Point Sets with Bounded Convex-Hull-Peeling Depth
We provide an efficient data structure for dynamically maintaining a ham-sandwich cut of two (possibly overlapping) point sets in the plane, with a bounded number of convex-hull peeling layers. The ham-sandwich cut of S1 and S2 is a line that simultaneously bisects the area, perimeter or vertex count of both point sets. Our algorithm supports insertion and deletion of vertices in O(c log n) tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Duke Mathematical Journal
سال: 2020
ISSN: 0012-7094
DOI: 10.1215/00127094-2020-0013